NP-Completeness of Non-Adjacency Relations on Some 0-1 Polytopes
نویسنده
چکیده
In this paper, we discuss the adjacency structures of some classes of 0-1 polytopes including knapsack polytopes, set covering polytopes and 0-1 polytopes represented by complete sets of implicants. We show that for each class of 0-1 polytope, non-adjacency test problems are NP-complete. For equality constrained knapsack polytopes, we can solve adjacency test problems in pseudo polynomial time.
منابع مشابه
On the family of 0/1-polytopes with NP-complete non-adjacency relation
In 1995 T. Matsui considered a special family 0/1-polytopes for which the problem of recognizing the non-adjacency of two arbitrary vertices is NP-complete. In 2012 the author of this paper established that all the polytopes of this family are present as faces in the polytopes associated with the following NP-complete problems: the traveling salesman problem, the 3-satisfiability problem, the k...
متن کاملAdjacency on Combinatorial Polyhedra
This paper shows some useful properties of the adjacency structures of a class of combinatorial polyhedra including the equality constrained 0-1 polytopes. The class of polyhedra considered here includes 0-1 polytopes related to some combinatorial optimization problems; e.g., set partitioning polytopes, set packing polytopes, perfect matching polytopes, vertex packing polytopes and all the face...
متن کاملTesting membership in the {0, 1/2}-closure is strongly NP-hard, even for polytopes contained in the n-dimensional 0/1-cube
Caprara and Fischetti introduced a class of cutting planes, called {0, 1/2}-cuts, which are valid for arbitrary integer linear programs. They also showed that the associated separation problem is strongly NPhard. We show that separation remains strongly NP-hard, even when all integer variables are binary, even when the integer linear program is a set packing problem, and even when the matrix of...
متن کاملComputing NodeTrix Representations of Clustered Graphs
NodeTrix representations are a popular way to visualize clustered graphs; they represent clusters as adjacency matrices and intercluster edges as curves connecting the matrix boundaries. We study the complexity of constructing NodeTrix representations focusing on planarity testing problems, and we show several NP-completeness results and some polynomial-time algorithms. Building on such algorit...
متن کاملComplementary Vertices and Adjacency Testing in Polytopes
Our main theoretical result is that, if a simple polytope has a pair of complementary vertices (i.e., two vertices with no facets in common), then it has a second such pair. Using this result, we improve adjacency testing for vertices in both simple and non-simple polytopes: given a polytope in the standard form {x ∈ R |Ax = b and x ≥ 0} and a list of its V vertices, we describe an O(n) test to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994